Verifying parameterized networks
نویسندگان
چکیده
منابع مشابه
Verifying Universal Properties of Parameterized Networks
Kai Baukus1 Yassine Lakhne h2y Karsten Stahl1 1 Institute of Computer S ien e and Applied Mathemati s University of Kiel Preusserstr. 1{9, D-24105 Kiel, Germany fkba, kstg informatik.uni-kiel.de 2 VERIMAG, Centre Equation 2 Av. de Vignate, 38610 Gi eres, Fran e lakhne h imag.fr Abstra t In this paper, we present a method for the veri ation of soalled universal properties of fair parameterized n...
متن کاملVerifying Parameterized Networks usingAbstraction and Regular Languages ?
This paper describes a technique based on network grammars and abstraction to verify families of state-transition systems. The family of state-transition systems is represented by a context-free network grammar. Using the structure of the network grammar our technique constructs an invariant which simulates all the state-transition systems in the family. A novel idea used in this paper is to us...
متن کاملVerifying Parameterized taDOM+ Lock Managers
taDOM* protocols are designed to provide lock-based approach to handle multiple access to XML databases. The notion of taDOM+ protocol is formalized and generalized and a formal model of taDOM+ lock manager that is parameterized in the number of transactions and in the size of database is represented. An important class of safety properties of taDOM+ lock managers were proven to be checked by e...
متن کاملVerifying Parameterized Timed Security Protocols
Quantitative timing is often explicitly used in systems for better security, e.g., the credentials for automatic website logon often has limited lifetime. Verifying timing relevant security protocols in these systems is very challenging as timing adds another dimension of complexity compared with the untimed protocol verification. In our previous work, we proposed an approach to check the corre...
متن کاملVerifying Absence of ∞ Loops in Parameterized Protocols
ion An abstract version of a program is a “simplification” of the program, with less “detail”. As such, it over-approximates the behavior of the program. The point of abstraction is to simplify the verification, by obtaining a simpler program from which we can draw conclusions about the original system [CC77, Sif84, CGL92, LGS95, KP00]. Many techniques based on abstraction compute an over-appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1997
ISSN: 0164-0925,1558-4593
DOI: 10.1145/265943.265960